Pascal and Francis Bibliographic Databases

Help

Search results

Your search

ti.\*:("Principles and practice of constraint programming - CP 97 (Linz, October 29 - November 1, 1997)")

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 28

  • Page / 2
Export

Selection :

  • and

Compiling constraint solving using projectionHARVEY, W; STUCKEY, P. J; BORNING, A et al.Lecture notes in computer science. 1997, pp 491-505, issn 0302-9743, isbn 3-540-63753-2Conference Paper

Understanding and improving the MAC algorithmSABIN, D; FREUDER, E. C.Lecture notes in computer science. 1997, pp 167-181, issn 0302-9743, isbn 3-540-63753-2Conference Paper

Bounding the optimum of Constraint optimization ProblemsDE GIVRY, S; VERFAILLIE, G; SCHIEX, T et al.Lecture notes in computer science. 1997, pp 405-419, issn 0302-9743, isbn 3-540-63753-2Conference Paper

Configuration solvers : Tailoring general methods to specific applicationsMINTON, S.Lecture notes in computer science. 1997, pp 372-374, issn 0302-9743, isbn 3-540-63753-2Conference Paper

Heavy-tailed distributions in combinatorial searchGOMES, C. P; SELMAN, B; CRATO, N et al.Lecture notes in computer science. 1997, pp 121-135, issn 0302-9743, isbn 3-540-63753-2Conference Paper

On the complexity of unification and disunification in commutative idempotent semigroupsHERMANN, M; KOLAITIS, P. G.Lecture notes in computer science. 1997, pp 282-296, issn 0302-9743, isbn 3-540-63753-2Conference Paper

Set constraints : A pearl in research on constraintsPACHOLSKI, L; PODELSKI, A.Lecture notes in computer science. 1997, pp 549-561, issn 0302-9743, isbn 3-540-63753-2Conference Paper

Tabu Search for maximal constraint satisfaction problemsGALINIER, P; HAO, J.-K.Lecture notes in computer science. 1997, pp 196-208, issn 0302-9743, isbn 3-540-63753-2Conference Paper

A filtering algorithm for global sequencing constraintsREGIN, J.-C; PUGET, J.-F.Lecture notes in computer science. 1997, pp 32-46, issn 0302-9743, isbn 3-540-63753-2Conference Paper

Five pitfalls of empirical scheduling researchBECK, J. C; DAVENPORT, A. J; FOX, M. S et al.Lecture notes in computer science. 1997, pp 390-404, issn 0302-9743, isbn 3-540-63753-2Conference Paper

Look-ahead versus look-back for satisfiability problemsCHU MIN LI; ANBULAGAN.Lecture notes in computer science. 1997, pp 341-355, issn 0302-9743, isbn 3-540-63753-2Conference Paper

Narrowing a 2n-block of sortings in O (n logn)GUERNALEC, N. B; COLMERAUER, A.Lecture notes in computer science. 1997, pp 2-16, issn 0302-9743, isbn 3-540-63753-2Conference Paper

Operational semantics and confluence of constraint propagation RulesABDENNADHER, S.Lecture notes in computer science. 1997, pp 252-266, issn 0302-9743, isbn 3-540-63753-2Conference Paper

Oscillation, heuristic ordering and pruning in neighborhood searchLABAT, J.-M; MYNARD, L.Lecture notes in computer science. 1997, pp 506-518, issn 0302-9743, isbn 3-540-63753-2Conference Paper

Random Constraint satisfaction : A more accurate pictureACHLIOPTAS, D; KIROUSIS, L. M; KRANAKIS, E et al.Lecture notes in computer science. 1997, pp 107-120, issn 0302-9743, isbn 3-540-63753-2Conference Paper

Solving classes of set constraints with tree automataDEVIENNE, P; TALBOT, J. M; TISON, S et al.Lecture notes in computer science. 1997, pp 62-76, issn 0302-9743, isbn 3-540-63753-2Conference Paper

The logic of search algorithms : Theory and applicationsGENT, I. P; UNDERWOOD, J. L.Lecture notes in computer science. 1997, pp 77-91, issn 0302-9743, isbn 3-540-63753-2Conference Paper

Finding solvable subsets of constraint graphsHOFFMANN, C. M; LOMONOSOV, A; SITHARAM, M et al.Lecture notes in computer science. 1997, pp 463-477, issn 0302-9743, isbn 3-540-63753-2Conference Paper

Reconfigurable architectures : A new vision for optimization problemsHAMADI, Y; MERCERON, D.Lecture notes in computer science. 1997, pp 209-221, issn 0302-9743, isbn 3-540-63753-2Conference Paper

AC-unification of higher-order patternsBOUDET, A; CONTEJEAN, E.Lecture notes in computer science. 1997, pp 267-281, issn 0302-9743, isbn 3-540-63753-2Conference Paper

Ordering constraints over feature treesMÜLLER, M; NIEHREN, J; PODELSKI, A et al.Lecture notes in computer science. 1997, pp 297-311, issn 0302-9743, isbn 3-540-63753-2Conference Paper

Satisfiability of quantitative temporal constraints with multiple granularitiesBETTINI, C; WANG, X. S; JAJODIA, S et al.Lecture notes in computer science. 1997, pp 435-449, issn 0302-9743, isbn 3-540-63753-2Conference Paper

Semantics and expressive power of a timed concurrent constraint languageDE BOER, F; MEO, M. C et al.Lecture notes in computer science. 1997, pp 47-61, issn 0302-9743, isbn 3-540-63753-2Conference Paper

Using constraint propagation for complex scheduling problems : Managing size, complex resources and travelCASEAU, Y.Lecture notes in computer science. 1997, pp 163-166, issn 0302-9743, isbn 3-540-63753-2Conference Paper

Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problemsBAPTISTE, P; LE PAPE, C.Lecture notes in computer science. 1997, pp 375-389, issn 0302-9743, isbn 3-540-63753-2Conference Paper

  • Page / 2